Comparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl
نویسندگان
چکیده
Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra’s algorithm is compared on dense graphs have positive edge weights ranging from 1 to 10. It is found that Dijkstra’s algorithm is better than Floyd warshall algorithm in sequencial implementation. But as there is less parallelism identified in dijkstra algorithm as compared to parallel to parallel FW gives less execution time as compared to Dijkstra’s.
منابع مشابه
A Parallel Recursive Approach for Solving All Pairs Shortest Path Problem on GPU using OpenCL
All-pairs shortest path problem(APSP) finds a large number of practical applications in real world. We owe to present a highly parallel and recursive solution for solving APSP problem based on Kleene’s algorithm. The proposed parallel approach for APSP is implemented using an open standard framework OpenCL which provides a development environment for utilizing massive parallel capabilities of M...
متن کاملCluster Formation and Cluster Head Selection approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique
Vehicular Ad-hoc Network (VANETs) is the specific form of Mobile ad-hoc networking (MANETs) in which high dynamic nodes are utilized in carrying out the operations. They are mainly used in urban areas for safety traveling. Clustering algorithms are used for clustering the vehicles that are in the range of the network as VANET consists of a great amount of traffic. A clustering head node is used...
متن کاملVerilog Implementation of a System for Finding Shortest Path by Using Floyd-Warshall Algorithm
There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum. Floyd-Warshall algorithm provides fastest computation of shortest path between all pair of nodes present in the graph. With rapid advances in VLSI technolog...
متن کاملThe Floyd-Warshall algorithm on graphs with negative cycles
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used to detect the presence of negative cycles. We will show that for this task many existing implementations of the Floyd-Warshall algorithm will fail because exponentially large numbers can appear during its execution.
متن کامل